Generalized Systolic Arrays for Discrete Transforms based on Orthonormal Polynomials
نویسنده
چکیده
Many discrete transforms, such as the discrete cosine transform (DCT), are derived from sets of orthonormal polynomials. These sets of polynomials all possess recursion relationships, derived from a classic identity. In this paper, this recursion is used to derive generalized systolic arrays for the forward and inverse transform operations.
منابع مشابه
A Study of Integer Sequences, Riordan Arrays, Pascal-like Arrays and Hankel Transforms
We study integer sequences and transforms that operate on them. Many of these transforms are defined by triangular arrays of integers, with a particular focus on Riordan arrays and Pascal-like arrays. In order to explore the structure of these transforms, use is made of methods coming from the theory of continued fractions, hypergeometric functions, orthogonal polynomials and most importantly f...
متن کاملRiordan-Bernstein Polynomials, Hankel Transforms and Somos Sequences
Using the language of Riordan arrays, we define a notion of generalized Bernstein polynomials which are defined as elements of certain Riordan arrays. We characterize the general elements of these arrays, and examine the Hankel transform of the row sums and the first columns of these arrays. We propose conditions under which these Hankel transforms possess the Somos-4 property. We use the gener...
متن کاملA numerical study of electrohydrodynamic flow analysis in a circular cylindrical conduit using orthonormal Bernstein polynomials
In this work, the nonlinear boundary value problem in electrohydrodynamics flow of a fluid in an ion-drag configuration in a circular cylindrical conduit is studied numerically. An effective collocation method, which is based on orthonormal Bernstein polynomials is employed to simulate the solution of this model. Some properties of orthonormal Bernstein polynomials are introduced and utilized t...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملSelf-tuning controllers based on orthonormal functions
Problems of the system identification using orthonormal functions are discussed and algorithms of computing parameters of the discrete time state-space model of the plant based on the generalized orthonormal functions and the Laguerre functions are derived. The adaptive LQ regulator and the predictive controller based on the Laguerre function model are also presented. The stability and the robu...
متن کامل